Shortest Path in a Combined Public Transportation Network
نویسنده
چکیده
Location Based Services that assist travelers in wayfinding are a prime application for expert system techniques. The use of public transportation leads nearly always to a combination of different services from different transportation companies (multi-modal transportation). Information systems must combine data for the different services and produce advice to navigate in space and to obtain the right tickets, reservations, etc. This information can be seen as the combination of two (or more) state-transition diagrams: one for the spatial navigation and one for the business (ticketing, validation, reservation) rules. A (categorical) product combines two state-transition diagrams. The implementation is immediate using an intuitionistic logic reasoner built into the programming language, which infers typing for second order, polymorphic functions and allows their safe execution. The shortest path algorithm in this combined network produces sound advice and reminds the user to acquire tickets and plans the necessary navigation to ticket vending machines, etc. The analysis shows how to specify the connections between the two graphs optimally. The approach combines typical expert system technologies like inference engines with object-oriented programing; recent advances increase the level of reasoning possible during compilation. The use of a high-level programming language with substantial inference power facilitates the formalization of domain knowledge and is a viable alternative to the classical expert system architecture. ”(Playing Chopin’s etudes) taught me a lifelong lesson: that phenomena perceived to be magical are always the outcome of complex patterns of nonmagical activities taking place at a level below perception. In other words, the magic behind magic is pattern.” Douglas Hofstadter, SCIENTIFIC AMERICAN, April, 1982, p. 17.
منابع مشابه
SOLVING BEST PATH PROBLEM ON MULTIMODAL TRANSPORTATION NETWORKS WITH FUZZY COSTS
Numerous algorithms have been proposed to solve the shortest-pathproblem; many of them consider a single-mode network and crispcosts. Other attempts have addressed the problem of fuzzy costs ina single-mode network, the so-called fuzzy shortest-path problem(FSPP). The main contribution of the present work is to solve theoptimum path problem in a multimodal transportation network, inwhich the co...
متن کاملThe Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint
In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...
متن کاملMINGLEI SONG et al: PATH SELECTION OF URBAN PUBLIC TRANSPORTATION BASED ON ..
Objective: to analyze and study the urban public transportation system and ant colony optimization algorithm, and propose the optimal route choice model based on GBAS. Method: theoretical analysis and algorithm analysis. Process: On the basis of detailed analysis of urban public transport system, a public transport network topology model is established, and the combined method of bus station an...
متن کاملConversion of Network Problem with Transfer Nodes, and Condition of Supplying the Demand of any Sink from the Particular Source to the Transportation Problem
In this article we present an algorithm for converting a network problem with several sources and several sinks including several transfer nodes and condition of supplying the demand of any sink from a particular source to the transportation problem. Towards this end, and considering the very special structure of transportation algorithm, after implementing the shortest path algorithm or ...
متن کاملTime-dependent Stochastic Shortest Path(s) Algorithms for a Scheduled Transportation Network
Following on from our work concerning travellers’ preferences in public transportation networks (Wu and Hartley, 2004), we introduce the concept of stochasticity to our algorithms. Stochasticity greatly increases the complexity of the route finding problem, so greater algorithmic efficiency becomes imperative. Public transportation networks (buses, trains) have two important features: edges can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- KI
دوره 22 شماره
صفحات -
تاریخ انتشار 2008